Solving Multiconstraint Assignment Problems Using Learning Automata
نویسندگان
چکیده
منابع مشابه
On Solving the Capacity Assignment Problem Using Continous Learning Automata
The Capacity Assignment problem focuses on finding the best possible set of capacities for the links that satisfy the traffic requirements in a prioritized network while minimizing the cost. Apart from the traditional methods for solving this NP-Hard problem, one new method that uses Learning Automata (LA) strategies has been recently reported. This method uses discretized learning automata [1]...
متن کاملSolving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملOnes Assignment Method for Solving Assignment Problems
Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملSolving Large Quadratic Assignment Problems
Quadratic Assignment problems are in practice among the most diicult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space searched. Much work has been done to identify such functions for the QAP, but with limited success. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
سال: 2010
ISSN: 1083-4419
DOI: 10.1109/tsmcb.2009.2032528